Continuous-time quantum walks on a cycle graph
نویسندگان
چکیده
منابع مشابه
Quantum walks of interacting fermions on a cycle graph
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel bet...
متن کاملContinuous-time quantum walks on star graphs
In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N -fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K2 graphs (Complete graph with two vertices) and the probability of observing wal...
متن کاملContinuous-time quantum walks on ultrametric spaces
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric space for the walk. This result presents a striking contrast to the classical random walk case. Moreover we clarify a difference between the ultrametric spa...
متن کاملContinuous Time Quantum Walks (CTQW)
Quantum computing became a prominent area of research with publications such as Feynman’s 1986 paper suggesting a construction for a Hamiltonian that can implement any quantum circuit [1]. Some of the key results in quantum information science such as Shor’s algorithm [2] and Grover’s algorithm [3] which show speed up over classical algorithms for integer factorisation and database searching ha...
متن کاملGraph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
In this paper, we explore analytically and experimentally a quasi-quantum analogue of the hitting time of the continuous-time quantum walk on a graph. For the classical random walk, the hitting time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. Our analysis shows that the quasi-quantum analogue of the hitt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2006
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.73.012313